On Depth and Depth+ of Boolean Algebras
نویسنده
چکیده
We show that the Depth of an ultraproduct of Boolean Algebras cannot jump over the Depth of every component by more than one cardinal. Consequently we have similar results for the Depth invariant.
منابع مشابه
Characterizing the Computable Structures: Boolean Algebras and Linear Orders
A countable structure (with finite signature) is computable if its universe can be identified with ω in such a way as to make the relations and operations computable functions. In this thesis, I study which Boolean algebras and linear orders are computable. Making use of Ketonen invariants, I study the Boolean algebras of low Ketonen depth, both classically and effectively. Classically, I give ...
متن کاملDepth Zero Boolean Algebras
We study the class of depth zero Boolean algebras, both from a classical viewpoint and an effective viewpoint. In particular, we provide an algebraic characterization, constructing an explicit measure for each depth zero Boolean algebra and demonstrating there are no others, and an effective characterization, providing a necessary and sufficient condition for a depth zero Boolean algebra of ran...
متن کاملDepth+ and Length+ of Boolean Algebras
Suppose κ = cf(κ), λ > cf(λ) = κ and λ = λ. We prove that there exist a sequence 〈Bi : i < κ〉 of Boolean algebras and an ultrafilterD on κ so that λ = ∏ i<κ Depth(Bi)/D < Depth ( ∏ i<κ Bi/D) = λ . An identical result holds also for Length. The proof is carried in ZFC, and it holds even above large cardinals. 2010 Mathematics Subject Classification. Primary: 06E05, 03G05. Secondary: 03E45.
متن کاملThe Depth of Ultraproducts of Boolean Algebras Sh853
We show that if μ is a compact cardinal then the depth of ultraproducts of less than μ many Boolean Algebras is at most μ plus the ultraproduct of the depths of those Boolean Algebras. I would like to thank Alice Leonhardt for the beautiful typing. This research was supported by the United States-Israel Binational Science Foundation First Typed 03/Nov/14 Latest Revision 05/May/3 Typeset by AMS-...
متن کاملDownward Closure of Depth in Countable Boolean Algebras
We study the set of depths of relative algebras of countable Boolean algebras, in particular the extent to which this set may not be downward closed within the countable ordinals for a fixed countable Boolean algebra. Doing so, we exhibit a structural difference between the class of arbitrary rank countable Boolean algebras and the class of rank one countable Boolean algebras.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005